Approximate Range Selection Queries in Peer-to-Peer Systems
نویسندگان
چکیده
We present an architecture for a data sharing peer-to-peer system where the data is shared in the form of database relations. In general, peer-to-peer systems try to locate exactmatch data objects to simple user queries. Since peer-to-peer users generally tend to submit broad queries in order to find data of their interest, we develop a P2P data sharing architecture for computing approximate answers for the complex queries by finding data ranges that are similar to the user query. Thus this paper represents the first step towards solving the general range lookup problem over P2P systems instead of exact lookup operations.
منابع مشابه
Towards a Unifying Framework for Complex Query Processing over Structured Peer-to-Peer Data Networks
In this work we study how to process complex queries in DHT-based Peer-to-Peer (P2P) data networks. Queries are made over tuples and relations and are expressed in a query language, such as SQL. We describe existing research approaches for query processing in P2P systems, we suggest improvements and enhancements, and propose a unifying framework that consists of a modified DHT architecture, dat...
متن کاملQuery Processing Over Peer-To-Peer Data Sharing Systems
Peer-to-peer systems are mainly used for object sharing currently, but they can provide the infrastructure for many other applications. In this paper, we extend the idea of object sharing to data sharing on a peer-to-peer system. We propose a method, which is based on the CAN [9] system, for efficiently evaluating range queries on such a system. The answers of the range queries are cached at th...
متن کاملTopic 7: Peer-to-Peer Computing
Distributed systems have experienced a shift of scale in the past few years. This evolution has generated an interest in peer-to-peer systems and resulted in much interesting work. Peer-to-peer systems are characterized by their potential to scale due to their fully decentralized nature. They are self-organizing, adapting automatically to peer arrivals and departures, and are highly resilient t...
متن کاملA Genetic Programming-based trust model for P2P Networks
Abstract— Peer-to-Peer ( P2P ) systems have been the center of attention in recent years due to their advantage . Since each node in such networks can act both as a service provider and as a client , they are subject to different attacks . Therefore it is vital to manage confidence for these vulnerable environments in order to eliminate unsafe peers . This paper investigates the use of genetic ...
متن کاملEnhanced Lookup Queries for Large-Scale Distributed Data Structures
Structured peer-to-peer systems are a class of distributed data structures that provided initially only exact-match queries in a scalable way. Exactmatch queries consist of retrieving single values from the network (i.e., put(key, value)/value←get(key)), in such a way that if the data exists, it is returned. Unfortunately, this service is not enough for modern distributed and parallel applicati...
متن کامل